Quantum sort
From HandWiki
Short description: Sorting algorithms for quantum computers
A quantum sort is any sorting algorithm that runs on a quantum computer. Any comparison-based quantum sorting algorithm would take at least [math]\displaystyle{ \Omega(n \log n) }[/math] steps,[1] which is already achievable by classical algorithms. Thus, for this task, quantum computers are no better than classical ones, and should be disregarded when it comes to time complexity. However, in space-bounded sorts, quantum algorithms outperform their classical counterparts.[2]
References
- ↑ Høyer, P.; Neerbek, J.; Shi, Y. (2001). "Quantum complexities of ordered searching, sorting, and element distinctness". 2076. pp. 62–73. doi:10.1007/3-540-48224-5_29. ISBN 978-3-540-42287-7.
- ↑ Klauck, Hartmut (2003). "Quantum Time-Space Tradeoffs for Sorting". p. 69. doi:10.1145/780542.780553. ISBN 1581136749.
| General |  | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Theorems | |||||||||
| Quantum communication | |||||||||
| Quantum algorithms | |||||||||
| Quantum complexity theory | |||||||||
| Quantum computing models | |||||||||
| Quantum error correction | |||||||||
| Physical implementations |
| ||||||||
| Software | |||||||||
 | This quantum mechanics-related article is a stub. You can help Wikipedia by expanding it. |
 |  |
